Strong Turing Degrees for Additive BSS RAM's
نویسندگان
چکیده
منابع مشابه
Strong Turing Degrees for Additive BSS RAM's
For the additive real BSS machines using only constants 0 and 1 and order tests we consider the corresponding Turing reducibility and characterize some semidecidable decision problems over the reals. In order to refine, step-by-step, a linear hierarchy of Turing degrees with respect to this model, we define several halting problems for classes of additive machines with different abilities and c...
متن کاملI classes, LR degrees and Turing degrees
We say that A ≤LR B if every B-random set is A-random with respect to Martin-Löf randomness. We study this reducibility and its interactions with the Turing reducibility, Π1 classes, hyperimmunity and other recursion theoretic notions. A natural variant of the Turing reducibility from the point of view of Martin-Löf randomness is the LR reducibility which was introduced in [12]. We say that A ≤...
متن کاملRandomness, relativization and Turing degrees
We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin-L?f random relative to 0_1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) > |x| ? c. The 'only if direction was obtained independently by Joseph Miller. This cha...
متن کاملTuring Degrees of Nonabelian Groups
For a countable structureA, the (Turing) degree spectrum of A is the set of all Turing degrees of its isomorphic copies. If the degree spectrum of A has the least degree d, then we say that d is the (Turing) degree of the isomorphism type of A. So far, degrees of the isomorphism types have been studied for abelian and metabelian groups. Here, we focus on highly nonabelian groups. We show that t...
متن کاملTuring degrees of multidimensional SFTs
In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any Π1 class P of {0, 1} there is a SFT X such that P ×Z is recursively homeomorphic to X \U where U is a computable set of points. As a consequence, if P contains a computable member, P and X have the exact same set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(4:25)2013